Approximation model building using genetic programming methodology: applications

نویسندگان

  • Luis F. Alvarez
  • Vassili V. Toropov
  • David C. Hughes
  • Ashraf F. Ashour
چکیده

Genetic Programming methodology is used for the creation of approximation functions obtained by the response surface methodology. Two important aspects of the problems are addressed: the choice of the plan of experiment and the model tuning using the least-squares response surface fitting. Several examples show the applications of the technique to problems where the values of response functions are obtained either by numerical simulation or laboratory experimentation.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Retracted: Using genetic algorithm approach to solve a multi-product EPQ model with defective items, rework, and constrained space

The Economic Production Quantity (EPQ) model is often used in the manufacturing sector to assist firms in determining the optimal production lot size that minimizes overall production-inventory costs. There are some assumptions in the EPQ model that restrict this model for real-world applications. Some of these assumptions are (1) infinite space of warehouse, (2) all of the pr...

متن کامل

A Method for Solving Optimal Control Problems Using Genetic Programming

This paper deals with a novel method for solving optimal control problems based on genetic programming. This approach produces some trial solutions and seeks the best of them. If the solution cannot be expressed in a closed analytical form then our method produces an approximation with a controlled level of accuracy. Using numerical examples, we will demonstrate how to use the results.

متن کامل

Application of Genetic Programming to Modeling and Prediction of Activity Coefficient Ratio of Electrolytes in Aqueous Electrolyte Solution Containing Amino Acids

Genetic programming (GP) is one of the computer algorithms in the family of evolutionary-computational methods, which have been shown to provide reliable solutions to complex optimization problems. The genetic programming under discussion in this work relies on tree-like building blocks, and thus supports process modeling with varying structure. In this paper the systems containing amino ac...

متن کامل

Bankruptcy Prediction: Dynamic Geometric Genetic Programming (DGGP) Approach

 In this paper, a new Dynamic Geometric Genetic Programming (DGGP) technique is applied to empirical analysis of financial ratios and bankruptcy prediction. Financial ratios are indeed desirable for prediction of corporate bankruptcy and identification of firms’ impending failure for investors, creditors, borrowing firms, and governments. By the time, several methods have been attempted in...

متن کامل

Model and Solution Approach for Multi objective-multi commodity Capacitated Arc Routing Problem with Fuzzy Demand

The capacitated arc routing problem (CARP) is one of the most important routing problems with many applications in real world situations. In some real applications such as urban waste collection and etc., decision makers have to consider more than one objective and investigate the problem under uncertain situations where required edges have demand for more than one type of commodity. So, in thi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007